The Use of Tree Transducers to Compute Translations Between Graph Algebras
نویسنده
چکیده
The power of top-down tree transducers and tree-to-graph-to-tree transducers (tgt transducers) to compute translations between hyperedge-replacement algebras is investigated. It turns out that top-down tree transducers are too weak in many cases. Tgt transducers are shown to be more powerful.
منابع مشابه
The Use of Tree Transducers to ComputeTranslations Between Graph
The power of top-down, bottom-up, and tree-to-graph-to-tree transducers (tgt transducers) to compute translations from hyperedge-replacement algebras into edge-replacement algebras is investigated. Compositions of top-down and bottom-up tree transducers are too weak if the operations in the target algebra are powerful enough to deene all series-parallel graphs, 2-trees, or related types of grap...
متن کاملHRNCE Grammars - A Hypergraph Generating System with an eNCE Way
Software Integration Problems and Coupling of Graph Grammar Specifications p. 155 Using Attributed Flow Graph Parsing to Recognize Cliches in Programs p. 170 Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers p. 185 The Use of Tree Transducers to Compute Translations Between Graph Algebras p. 196 The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars p. 2...
متن کاملSynchronous Forest Substitution Grammars
The expressive power of synchronous forest (tree-sequence) substitution grammars (SFSG) is studied in relation to multi bottom-up tree transducers (MBOT). It is proved that SFSG have exactly the same expressive power as compositions of an inverse MBOT with an MBOT. This result is used to derive complexity results for SFSG and the fact that compositions of an MBOT with an inverse MBOT can comput...
متن کاملMacro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
A characterization is given of the class of tree translations definable in monadic second-order logic (MSO), in terms of macro tree transducers. The first main result is that the MSO definable tree translations are exactly those tree translations realized by macro tree transducers (MTTs) with regular look-ahead that are single use restricted. For this the single use restriction known from attri...
متن کاملThe Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers
We introduce the bottom-up tree-to-graph transducer, which is very similar to the usual (total deterministic) bottom-up tree transducer except that it translates trees into hypergraphs rather than trees, using hypergraph substitution instead of tree substitution. If every output hypergraph of the transducer is a jungle, i.e., a hypergraph that can be unfolded into a tree, then the tree-to-graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994